Equivalence of Decoupling Schemes and Orthogonal Arrays
نویسندگان
چکیده
منابع مشابه
Orthogonal arrays and ordered threshold schemes
E. Dawson Infonnation Security Research Centre Queensland University of Technology GPO Box 2434 Brisbane Queensland 400 1 Australia E.S.~ahmocKlian Department of ~athematical Sciences Sharif University of Technology PO Box 11365 9415 Tehran Iran Alan Rahilly Centre for Combinatorics Department of ~athematics University of Queensland Brisbane Queensland 4072 Australia Perfect threshold schemes w...
متن کاملEfficient decoupling schemes with bounded controls based on Eulerian orthogonal arrays
The task of decoupling, i.e., removing unwanted internal couplings of a quantum system and its couplings to an environment, plays an important role in quantum control theory. There are many efficient decoupling schemes based on combinatorial concepts such as orthogonal arrays, difference schemes, and Hadamard matrices. So far these combinatorial decoupling schemes have relied on the ability to ...
متن کاملOrthogonal Arrays
Definition Orthogonal arrays (OAs) are objects that are most often generated via algebraic arguments. They have a number of applications in applied mathematics, and have often been studied by algebraic mathematicians as objects of interest in their own right. Our treatment will reflect their use as representations of statistical experimental designs. An OA is generally presented as a two-dimens...
متن کاملOrthogonal Arrays
(say) is called symmetric, otherwise, the array is said to be asymmetric. Several methods of construction of symmetric as well as asymmetric OAs are available in the literature. Some important methods will be discussed here. One of the principal applications of the OAs is in the selection of level combinations for fractional factorial experiments. An OA of strength t is equivalent to an orthogo...
متن کاملCyclic orthogonal and balanced arrays
Kuriki and Fuji-Hara (1994) introduced an (r, 2)-design with mutually balanced nested subdesigns ((r, 2)-design with MBN), which is equivalent to a balanced array of strength 2 with s symbols, and gave some constructions of such (r, 2)-designs. In this paper, we consider cyclic orthogonal and balanced arrays, and we give a cyclic version of the results obtained by them. Furthermore, we give a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2006
ISSN: 0018-9448
DOI: 10.1109/tit.2006.880059